The Linear Arrangement Problem Parameterized Above Guaranteed Value
نویسندگان
چکیده
منابع مشابه
The Linear Arrangement Problem Parameterized Above Guaranteed Value
A linear arrangement (LA) is an assignment of distinct integers to the vertices of a graph. The cost of an LA is the sum of lengths of the edges of the graph, where the length of an edge is defined as the absolute value of the difference of the integers assigned to its ends. For many application one hopes to find an LA with small cost. However, it is a classical NP-complete problem to decide wh...
متن کاملParameterized algorithmics for linear arrangement problems
We discuss different variants of linear arrangement problems from a parameterized perspective. More specifically, we concentrate on developing simple search tree algorithms for these problems. However, the analysis of these algorithms is sometimes not so easy.
متن کاملThe planar minimum linear arrangement problem is different from the minimum linear arrangement problem
In various research papers, such as [2], one will find the claim that the minLA is optimally solvable on outerplanar graphs, with a reference to [1]. However, the problem solved in that publication, which we refer to as the planar minLA, is different from the minLA, as we show in this article. In constrast to the minimum linear arrangement problem (minLA), the planar minimum linear arrangement ...
متن کاملDirected Acyclic Subgraph Problem Parameterized above the Poljak-Turzik Bound
An oriented graph is a directed graph without directed 2-cycles. Poljak and Turzík (1986) proved that every connected oriented graph G on n vertices and m arcs contains an acyclic subgraph with at least m2 + n−1 4 arcs. Raman and Saurabh (2006) gave another proof of this result and left it as an open question to establish the parameterized complexity of the following problem: does G have an acy...
متن کاملA Tutorial on the Linear Arrangement Problem
Scatter search (SS) and path relinking (PR) are evolutionary methods that have been successfully applied to a wide range of hard optimization problems. The fundamental concepts and principles of the methods were first proposed in the 1970s and 1980s, and were based on formulations, dating back to the 1960s, for combining decision rules and problem constraints. The methods use strategies for sea...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theory of Computing Systems
سال: 2007
ISSN: 1432-4350,1433-0490
DOI: 10.1007/s00224-007-1330-6